class Solution {
    public int[][] floodFill(int[][] image, int sr, int sc, int color) {
        int prev = image[sr][sc];
        if(color==prev) return image;
        Queue<int[]> q=new  LinkedList<>();
        q.add(new int[]{sr,sc});
        int m=image.length;
        int n=image[0].length;
         int[] dx={0,0,1,-1};
        int[] dy={1,-1,0,0};
        while(!q.isEmpty()){
            int[] t = q.poll();
            int a=t[0],b=t[1];
            image[a][b]=color;
            for(int i=0;i<4;i++){
                int x=a+dx[i],y=b+dy[i];
                if(x>=0&&x<m&&y>=0&&y<n&&image[x][y]==prev){
                    q.add(new int[]{x,y});
                }
            }
        }
        return image;
    }
}